Strongly separable codes

Strongly separable codes

Binary t-frameproof codes (t-FPCs) are used in multimedia fingerprinting schemes where the identification of authorized users taking part in the averaging collusion attack is required. In this paper, a binary strongly t-separable code (t-SSC) is introduced to improve such a scheme based on a binary t-FPC. A binary t-SSC has the same traceability as a binary t-FPC but has more codewords than a b...

Cumulative-Separable Codes

A t first Γ(L,G)-codes were introduced by V.D.Goppa [1] in 1970. These codes are a large and powerful class of error correcting codes. F.J. McWilliams and N.J. Sloane [2] defined these codes as the most important class of alternant codes. It is known that there are Γ(L,G)-codes that reach the Gilbert-Varshamov bound and that many Γ(L,G)-codes are placed in the Table of the best known codes [3]....

On strongly identifying codes

Strongly Conflict-Avoiding Codes

Strongly conflict-avoiding codes are used in the asynchronous multiple-access collision channel without feedback. The number of codewords in a strongly conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, an upper bound on the size of strongly conflictavoiding codes is proved. In addition, we provide an improved upper bound if the codes are...

A Model with No Strongly Separable Almost Disjoint Families

We answer a question of Shelah and Steprāns [6] by producing a model of ZFC where there are no strongly separable almost disjoint families. The notion of a strongly separable almost disjoint family is a natural variation on the well known notion of a completely separable almost disjoint family, and is closely related to the metrization problem for countable Fréchet groups.